import java.util.Arrays;

public class Test {
    public static void main(String[] args) {
        int a = 1000000007;
        System.out.println(Integer.MAX_VALUE);//2*10^9
    }
}
class Solution {
    int MOD = 1000000007;
    public int sumDistance(int[] nums, String s, int d) {
        int n = nums.length;
        long[] pos = new long[n];
        for(int i=0; i<n; i++){
            char ch = s.charAt(i);
            if(ch == 'R')
                pos[i] = (long)nums[i]+d;
            else
                pos[i] = (long)nums[i]-d;
        }
        Arrays.sort(pos);
        long res = 0;
        for(int i=1; i<n; i++){
            res += (pos[i]-pos[i-1])*i%MOD*(n-i)%MOD;
            res %= MOD;
        }
        return (int) res;
    }
    int addAB(int a, int b){
        do{
            int t = a&b;//判断是否需要进位
            a = a^b;//加法运算
            b = t<<1;//进位后
        }while (b!=0);
        return a;
    }
}
